GATE PYQ

ISRO CSE 2016

Q1.
When a DNS server accepts and uses incorrect information from a host that has no authority giving that information, then it is called

Q2.
Relative mode of addressing is most relevant to writing:

Q3.
What will be output of the following program? Assume that you are running this program in little-endian processor. #include < stdio.h > int main() { short a=320; char ptr; ptr=(char )&a printf("%d",*ptr); return 0; }

Q4.
What is the output of this C code? #include < stdio.h > void main() { int k=5; int *p=&k int **m=&p printf("%d %d %d",k,*p,**m); }

Q5.
The average number of key comparisons required for a successful search for sequential search on n items is

Q6.
Access time of the symbolic table will be logarithmic if it is implemented by

Q7.
Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 1 ns, 10 ns, and 500 ns respectively. The hit rates of Level 1 and Level 2 caches are 0.8 and 0.9, respectively. What is the average access time of the system ignoring the search time within the cache?

Q8.
\lim_{x\rightarrow 0}\frac{\sqrt{1+x}-\sqrt{1-x}}{x} is given by

Q9.
A complete binary tree with n non-leaf nodes contains

Q10.
S \rightarrow a S a|b S b| a \mid bThe language generated by the above grammar over the alphabet {a,b} is the set of: